Bayesian network modeling for evolutionary genetic structures
نویسندگان
چکیده
منابع مشابه
Bayesian network modeling for evolutionary genetic structures
BANANA provides a graphical connection of these 12 factors with 26 arcs, showing that: a) Defense ability (DA) is the major factor in survival (with 8 arcs constraints); b) Energy lost in fighting (LA) is the second important factor (with seven arcs constraints); c) The relationships and dependencies also indicate that speedy attack ability (SA), and the energy cost of survival (EF) (with six a...
متن کاملEvolutionary Methods for Learning Bayesian Network Structures
Bayesian networks (BN) are a family of probabilistic graphical models representing a joint distribution for a set of random variables. Conditional dependencies between these variables are symbolized by a Directed Acyclic Graph (DAG). Two classical approaches are often encountered when automaticaly determining an appropriate graphical structure from a database of cases,. The first one consists i...
متن کاملAn Evolutionary Algorithm for Bayesian Network Triangulation
The problem of triangulation (decomposition) of Bayesian networks is considered. Triangularity of a Bayesian network is required in a general evidence propagation scheme on this network. Finding an optimal triangulation is NP-hard. A local search heuristic based on the idea of evolutionary algorithms is presented. The results obtained using existing and proposed approaches are compared on a bas...
متن کاملBayesian Network Automata for Modelling Unbounded Structures
This paper proposes a framework which unifies graphical model theory and formal language theory through automata theory. Specifically, we propose Bayesian Network Automata (BNAs) as a formal framework for specifying graphical models of arbitrarily large structures, or equivalently, specifying probabilistic grammars in terms of graphical models. BNAs use a formal automaton to specify how to cons...
متن کاملApproximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.12.039